Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
نویسندگان
چکیده
منابع مشابه
A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem
The Capacitated m-ring-star Problem is a variant of the classical one-depot capacitated vehicle routing problem in which a customer is either on a route or is connected to another customer or to some Steiner point present in a route. We develop a new exact algorithm for this problem using a branch-and-cut-and-price approach and compare its performance with that of a branch-and-cut algorithm pro...
متن کاملA branch-price-and-cut algorithm for the mixed capacitated general routing problem with time windows
We introduce the Mixed Capacitated General Routing Problem with Time Windows (MCGRPTW). This problem is defined over a mixed graph, for which some nodes, arcs and edges have strictly positive demand and must be serviced through a fleet of homogeneous capacitated vehicles. The aim is to find a set of least-cost vehicle routes that satisfy this requirement, while respecting pre-specified time win...
متن کاملRobust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Abstract. The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and ca...
متن کاملA Branch-and-Cut-and-Price algorithm for the Multi-Depot Capacitated Vehicle Routing Problem with Stochastic Demands
In this article we introduce and implement a branch-and-cut-and-price algorithm for the Multiple Depot Vehicle Routing Problem with Stochastic Demands. We consider the delivery of a common commodity to a set of customers from a set of non-capacitated depots. The demand of each customer is described by a random variable, whose actual value becomes known upon arrival at the customer. The deliveri...
متن کاملSolving Routing Problems with Branch-Cut-and-Price
Marcus Poggi de Aragão Dep.de Informática Pontif́ıcia Universidade Católica do Rio de Janeiro [email protected] Eduardo Uchoa Dep. Eng. de Produção Universidade Federal Fluminense [email protected] January 15th, 2005 The Capacitated Vehicle Routing Problem (CVRP) is the most basic variant of a vehicle routing problem: homogeneous fleet, single depot, only deliveries, no time-windows, and ...
متن کامل